package digui;

public class GetMax {
    public static int process(int[] arr, int L, int R) {
        if (L == R) {
            return arr[L];
        }
//        int mid = (L + R) / 2;
//        int mid = L + (R - L) / 2;
        int mid = L + ((R - L) >> 1);
        int leftMax = process(arr, L, mid);
        int rightMax = process(arr, mid + 1, R);
        return Math.max(leftMax, rightMax);
    }

    public static void main(String[] args) {
//        int[] arr = new int[] {1,4,5,6,7,3,2,5,76,8,0,3,4,5,6,87,5,3,3};
//        int res = process(arr, 0, arr.length-1);
//        System.out.println(res);
        int testTimes = 100;
        int maxSize = 100;
        int maxValue = 100;
    }
}
